Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices
نویسندگان
چکیده
An algorithm is given for the problem of finding the finest simultaneous block-diagonalization of a given set of square matrices. This problem has been studied independently in the area of semidefinite programming and independent component analysis. The proposed algorithm considers the commutant algebra of the matrix ∗-algebra generated by the given matrices. It is simpler than other existing methods, and has the capability of controlling numerical errors. Some numerical examples are presented to demonstrate its merits.
منابع مشابه
A block variational procedure for the iterative diagonalization of non-Hermitian random-phase approximation matrices.
We present a technique for the iterative diagonalization of random-phase approximation (RPA) matrices, which are encountered in the framework of time-dependent density-functional theory (TDDFT) and the Bethe-Salpeter equation. The non-Hermitian character of these matrices does not permit a straightforward application of standard iterative techniques used, i.e., for the diagonalization of ground...
متن کاملFast block diagonalization of k-tridiagonal matrices
In the present paper, we give a fast algorithm for block diagonalization of k-tridiagonal matrices. The block diagonalization provides us with some useful results: e.g., another derivation of a very recent result on generalized k-Fibonacci numbers in [M.E.A. El-Mikkawy, T. Sogabe, A new family of k-Fibonacci numbers, Appl. Math. Comput. 215 (2010) 4456– 4461]; efficient (symbolic) algorithm for...
متن کاملGlobally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
In this paper, we consider a family of Jacobi-type algorithms for simultaneous orthogonal diagonalization problem of symmetric tensors. For the Jacobi-based algorithm of [SIAM J. Matrix Anal. Appl., 2(34):651–672, 2013], we prove its global convergence for simultaneous orthogonal diagonalization of symmetric matrices and 3rd-order tensors. We also propose a new Jacobi-based algorithm in the gen...
متن کاملSimultaneous Matrix Diagonalization: the Overcomplete Case
Many algorithms for Independent Component Analysis rely on a simultaneous diagonalization of a set of matrices by means of a nonsingular matrix. In this paper we provide means to determine the matrix when it has more columns than rows.
متن کاملOn Block Matrices Associated with Discrete Trigonometric Transforms and Their Use in the Theory of Wave Propagation
Block matrices associated with discrete Trigonometric transforms (DTT’s) arise in the mathematical modelling of several applications of wave propagation theory including discretizations of scatterers and radiators with the Method of Moments, the Boundary Element Method, and the Method of Auxiliary Sources. The DTT’s are represented by the Fourier, Hartley, Cosine, and Sine matrices, which are u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 32 شماره
صفحات -
تاریخ انتشار 2011